JFLAP2TikZ Andrew Mertz and William Slough Introduction JFLAP1 is a popular Java program for experimenting with finite state machines, Turing machines and other concepts from Formal Languages and Automata Theory. Version

Source URL: ctan.sciserv.eu

• Theoretical computer science
• Computer science
• PGF/TikZ
• Turing machine
• Finite-state machine
• Pushdown automaton
• Models of computation
• Theory of computation
• Automata theory

PDF Document

Source URL: bms.ulb.ac.be

• Theoretical computer science
• Mathematics
• Theory of computation
• Entscheidungsproblem
• Turing machine
• Turing test
• Andrew Hodges
• Bombe
• Enigma machine
• Alan Turing
• British people
• Computability theory

Sober Spaces and Continuations Paul Taylor August 5, 2003 Abstract A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational

Source URL: www.paultaylor.eu

• Functions and mappings
• Theoretical computer science
• Formal methods
• Models of computation
• Model theory
• Symbol
• Lambda calculus
• Interpretation
• Primitive recursive function
• Mathematics
• Mathematical logic
• Computability theory

Distributed Computing Column 39 Byzantine Generals: The Next Generation Idit Keidar Dept. of Electrical Engineering, Technion Haifa, 32000, Israel

Source URL: webee.technion.ac.il

• Theory of computation
• Cryptography
• Failure
• Fault tolerance
• Fault-tolerant computer systems
• Consensus
• Distributed computing
• Scalability
• Gossip protocol
• Theoretical computer science
• Computing
• Applied mathematics

Regular-expression derivatives reexamined SCOTT OWENS University of Cambridge

Source URL: www.ccs.neu.edu

• Models of computation
• Computer science
• Software engineering
• Nondeterministic finite automaton
• Deterministic finite automaton
• Regular language
• Symbol
• String
• Regular expression
• Automata theory
• Formal languages
• Theoretical computer science

1993 Paper 5 Question 10 Computation Theory Show that there is no way of deciding by algorithms whether a general register machine program with code p will terminate when started with initial data of 0 in every register

Source URL: www.cl.cam.ac.uk

Submitted to Sci. Math. Japonicae 1 Limiting rst order realizability interpretation Masahiro Nakata and Susumu Hayashi

Source URL: www.shayashi.jp

• Theory of computation
• Computability theory
• Function
• Integral calculus
• Primitive recursive function
• Fundamental theorem of calculus
• Mathematics
• Mathematical analysis
• Functions and mappings

BRICS RSBiernacka & Danvy: A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Applied mathematics
• Models of computation
• Computability theory
• Explicit substitution
• Reduction strategy
• Operational semantics
• Beta normal form
• Overlap
• Formal language
• Mathematics
• Theoretical computer science
• Lambda calculus

Computing over the Reals: Foundations for Scientific Computing Mark Braverman and Stephen Cook Introduction

Source URL: www.ams.org

• Computer science
• Theory of computation
• Alan Turing
• Models of computation
• Computable function
• Church–Turing thesis
• Computability
• Computational complexity theory
• Computable number
• Computability theory
• Theoretical computer science
• Mathematics

BRICS RSO. Danvy: From Reduction-Based to Reduction-Free Normalization BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Computability theory
• Formal languages
• Logic in computer science
• Lambda calculus
• Models of computation
• Reduction strategy
• Standard ML
• Function
• Normal form
• Theoretical computer science
• Mathematics
• Programming language theory